Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
نویسندگان
چکیده
منابع مشابه
Automorphism groups of Cayley graphs generated by connected transposition sets
Let S be a set of transpositions that generates the symmetric group Sn, where n ≥ 3. The transposition graph T (S) is defined to be the graph with vertex set {1, . . . , n} and with vertices i and j being adjacent in T (S) whenever (i, j) ∈ S. We prove that if the girth of the transposition graph T (S) is at least 5, then the automorphism group of the Cayley graph Cay(Sn, S) is the semidirect p...
متن کاملRotational Cayley Graphs on Transposition Generated Groups
As it is introduced by Bermond, Kodate, and Prennes, some Cayley graphs, including most popular models for interconnection networks, admit a special auto-morphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, optimal gossiping algorithms can be easily designed, and the constructions of the best known edge d...
متن کاملOn minimal symmetric automorphism groups of finite symmetric graphs
Let r be finite connected and G a group of automorphisms of r which is transitive on vertices. Suppose that, for a vertex 0 of r, S ~ G~(O') ::; Aut S for some simple group S with S acting primitively on the set r( a) of neighbours of 0, and suppose that G is minimal with these properties. Then one of: (i) G is a nonabelian simple group, (ii) r is a Cayley graph for a normal subgroup N of G and...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملOn the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2006
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2005.06.010